A Generic Disjunctive/Conjunctive Decomposition Model for n-ary Relations.
نویسندگان
چکیده
This paper discusses a generic decomposition model that represents an arbitrary n-ary relation as a disjunctive or conjunctive combination of a number of n-ary component relations of a prespecified type. An important subclass of order-preserving decompositions is defined and its properties are derived. The generic model is shown to subsume various known models as special cases, including the models of Boolean factor analysis, hierarchical classes analysis, and disjunctive/conjunctive nonmetric factor analysis. Moreover, it also subsumes a broad range of new models as exemplified with a novel model for multidimensional parallelogram analysis and novel three-way extensions of nonmetric factor analysis. Copyright 1999 Academic Press.
منابع مشابه
Conjunctive Query Containment in Description Logics with n-ary Relations
Recent research points out that query containment is a central problem in several database and knowledge base applications, including data warehousing, data integration, query optimization, and (materialized) view maintenance. In this paper we present a decision procedure for containment of conjunctive queries de ned over a database schema speci ed in a very expressive description logic, compri...
متن کاملApplication of fundamental relations on n-ary polygroups
The class of $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...
متن کاملImplications, coimplications and left semi-uninorms on a complete lattice
In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...
متن کاملEfficient Enumeration for Conjunctive Queries over X-underbar Structures
We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property. Tree-like relations such as XPath axes or grids are natural examples of such relations. We first show that the result of an n-ary conjunctive query Q over an X structure S can be enumerated with a delay in O(n·|S|·|Q|) between two consecutive n-tuples. Then, w...
متن کاملSeparability and Aggregation of Equivalence Relations
We provide axiomatic characterizations of two natural families of rules for aggregating equivalence relations: the family of join aggregators and the family of meet aggregators. The central conditions in these characterizations are two separability axioms. Disjunctive separability, neutrality, and unanimity characterize the family of join aggregators. On the other hand, conjunctive separability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of mathematical psychology
دوره 43 1 شماره
صفحات -
تاریخ انتشار 1999